0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.11	% Command    : run_E %s %d THM
0.11/0.32	% Computer : n008.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1440
0.11/0.32	% WCLimit    : 180
0.11/0.32	% DateTime   : Thu Jul  4 07:34:09 EDT 2024
0.11/0.32	% CPUTime    : 
0.19/0.46	Running higher-order theorem proving
0.19/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.m2zGu7PP4t/E---3.1_31555.p
1.31/0.81	# Version: 3.2.0-ho
1.31/0.81	# partial match(1): HSLMSMSSSSLCHFA
1.31/0.81	# Preprocessing class: HSLMSLSSSSLCHFA.
1.31/0.81	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
1.31/0.81	# Starting new_ho_10 with 900s (5) cores
1.31/0.81	# Starting sh5l with 180s (1) cores
1.31/0.81	# Starting lpo8_s with 180s (1) cores
1.31/0.81	# Starting ehoh_best_nonlift_rwall with 180s (1) cores
1.31/0.81	# sh5l with pid 31634 completed with status 0
1.31/0.81	# Result found by sh5l
1.31/0.81	# partial match(1): HSLMSMSSSSLCHFA
1.31/0.81	# Preprocessing class: HSLMSLSSSSLCHFA.
1.31/0.81	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
1.31/0.81	# Starting new_ho_10 with 900s (5) cores
1.31/0.81	# Starting sh5l with 180s (1) cores
1.31/0.81	# SinE strategy is gf500_gu_R04_F100_L20000
1.31/0.81	# Search class: HGHSF-FSLM31-DHFFFSBC
1.31/0.81	# partial match(1): HGHSM-FSLM31-DHFFFSBC
1.31/0.81	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
1.31/0.81	# Starting new_ho_10 with 98s (1) cores
1.31/0.81	# new_ho_10 with pid 31637 completed with status 0
1.31/0.81	# Result found by new_ho_10
1.31/0.81	# partial match(1): HSLMSMSSSSLCHFA
1.31/0.81	# Preprocessing class: HSLMSLSSSSLCHFA.
1.31/0.81	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
1.31/0.81	# Starting new_ho_10 with 900s (5) cores
1.31/0.81	# Starting sh5l with 180s (1) cores
1.31/0.81	# SinE strategy is gf500_gu_R04_F100_L20000
1.31/0.81	# Search class: HGHSF-FSLM31-DHFFFSBC
1.31/0.81	# partial match(1): HGHSM-FSLM31-DHFFFSBC
1.31/0.81	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
1.31/0.81	# Starting new_ho_10 with 98s (1) cores
1.31/0.81	# Preprocessing time       : 0.005 s
1.31/0.81	# Presaturation interreduction done
1.31/0.81	
1.31/0.81	# Proof found!
1.31/0.81	# SZS status Theorem
1.31/0.81	# SZS output start CNFRefutation
1.31/0.81	thf(decl_25, type, c_not: $o > $o).
1.31/0.81	thf(decl_26, type, c_and: $o > $o > $o).
1.31/0.81	thf(decl_29, type, c_In: $i > $i > $o).
1.31/0.81	thf(decl_31, type, c_Empty: $i).
1.31/0.81	thf(decl_33, type, c_Power: $i > $i).
1.31/0.81	thf(decl_35, type, c_TransSet: $i > $o).
1.31/0.81	thf(decl_36, type, c_atleast2: $i > $o).
1.31/0.81	thf(decl_37, type, c_atleast3: $i > $o).
1.31/0.81	thf(decl_39, type, c_atleast5: $i > $o).
1.31/0.81	thf(decl_41, type, c_exactly2: $i > $o).
1.31/0.81	thf(decl_44, type, c_exactly5: $i > $o).
1.31/0.81	thf(decl_60, type, c_exactly1of2: $o > $o > $o).
1.31/0.81	thf(decl_79, type, c_ordsucc: $i > $i).
1.31/0.81	thf(decl_80, type, c_nat_p: $i > $o).
1.31/0.81	thf(decl_84, type, c_ordinal: $i > $o).
1.31/0.81	thf(decl_93, type, c_binrep: $i > $i > $i).
1.31/0.81	thf(decl_116, type, c_SNoLt: $i > $i > $o).
1.31/0.81	thf(decl_126, type, epred1_2: $i > $i > $o).
1.31/0.81	thf(decl_127, type, epred2_2: $i > $i > $o).
1.31/0.81	thf(decl_130, type, esk1_0: $i).
1.31/0.81	thf(decl_131, type, esk2_0: $i).
1.31/0.81	thf(decl_132, type, esk3_0: $i).
1.31/0.81	thf(decl_133, type, esk4_1: $i > $i).
1.31/0.81	thf(decl_224, type, epred61_1: $i > $i > $o).
1.31/0.81	thf(ax63, axiom, ((c_nat_p)=(^[X193:$i]:(![X194:$i > $o]:((((X194 @ X193)<=![X3:$i]:(((X194 @ (c_ordsucc @ X3))<=(X194 @ X3))))<=(X194 @ c_Empty)))))), file('/export/starexec/sandbox2/tmp/tmp.m2zGu7PP4t/E---3.1_31555.p', ax63)).
1.31/0.81	thf(conj, conjecture, ![X46:$i]:((![X2:$i]:(((c_In @ X2 @ X46)=>![X3:$i]:((?[X7:$i]:(![X10:$i]:((((((c_exactly2 @ X7)<=(c_ordinal @ X7))=>((c_atleast2 @ X7)=>((((c_not @ ((c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))))=>((X7)=(X10)))=>(c_atleast3 @ X7))=>(c_and @ ((c_atleast5 @ X3)) @ ((c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))) @ ((c_TransSet @ X10))))))))))=>(c_nat_p @ X7))<=((c_ordinal @ X7)=>(c_and @ ((c_exactly2 @ X7)) @ ((c_not @ ((c_exactly5 @ X10)))))))))<=(c_In @ X3 @ X2)))))<=(c_In @ X46 @ c_Empty))), file('/export/starexec/sandbox2/tmp/tmp.m2zGu7PP4t/E---3.1_31555.p', conj)).
1.31/0.81	thf(c_0_2, plain, ![X7:$i, X10:$i]:(((epred1_2 @ X10 @ X7)<=>((~(c_exactly2 @ X7)|((((~(c_exactly5 @ X10)|~(c_not @ $true))&((c_exactly5 @ X10)|~(c_not @ $false)))|(c_and @ $true @ $true))&(((~(c_exactly5 @ X10)|(c_not @ $true))&((c_exactly5 @ X10)|(c_not @ $false)))|(c_and @ $true @ $false))))&((c_exactly2 @ X7)|((((~(c_exactly5 @ X10)|~(c_not @ $true))&((c_exactly5 @ X10)|~(c_not @ $false)))|(c_and @ $false @ $true))&(((~(c_exactly5 @ X10)|(c_not @ $true))&((c_exactly5 @ X10)|(c_not @ $false)))|(c_and @ $false @ $false))))))), introduced(definition)).
1.31/0.81	thf(c_0_3, plain, ![X3:$i, X10:$i]:(((epred2_2 @ X10 @ X3)<=>((~(c_atleast5 @ X3)|((((((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $false)))))|~(c_not @ $true))&(((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $false @ $false)))))|~(c_not @ $false)))|(c_and @ $true @ $true))&(((((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $false)))))|(c_not @ $true))&(((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $false @ $false)))))|(c_not @ $false)))|(c_and @ $true @ $false))))&((c_atleast5 @ X3)|((((((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $false)))))|~(c_not @ $true))&(((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $false @ $false)))))|~(c_not @ $false)))|(c_and @ $false @ $true))&(((((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|~(c_exactly1of2 @ $false @ $false)))))|(c_not @ $true))&(((~(c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $true @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $true @ $false))))&((c_SNoLt @ X3 @ (c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty)))) @ c_Empty))|((~(c_TransSet @ X10)|(c_exactly1of2 @ $false @ $true))&((c_TransSet @ X10)|(c_exactly1of2 @ $false @ $false)))))|(c_not @ $false)))|(c_and @ $false @ $false))))))), introduced(definition)).
1.31/0.81	thf(c_0_4, plain, ((c_nat_p)=(^[Z0/* 6 */:$i]:(![X194:$i > $o]:(((X194 @ Z0<=![X3:$i]:((X194 @ (c_ordsucc @ X3)<=X194 @ X3)))<=X194 @ c_Empty))))), inference(fof_simplification,[status(thm)],[ax63])).
1.31/0.81	thf(c_0_5, negated_conjecture, ~(![X46:$i]:(((c_In @ X46 @ c_Empty)=>![X2:$i]:(((c_In @ X2 @ X46)=>![X3:$i]:(((c_In @ X3 @ X2)=>?[X7:$i]:(![X10:$i]:((((c_ordinal @ X7)=>(epred1_2 @ X10 @ X7))=>((((c_ordinal @ X7)=>(c_exactly2 @ X7))=>((c_atleast2 @ X7)=>(((((~(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|(c_not @ $true))&((c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|(c_not @ $false)))=>((X7)=(X10)))=>(c_atleast3 @ X7))=>(epred2_2 @ X10 @ X3))))=>(c_nat_p @ X7)))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[conj])])]), c_0_2]), c_0_3])).
1.31/0.81	thf(c_0_6, plain, ((c_nat_p)=(^[Z0/* 6 */:$i]:(![X725:$i > $o]:((((X725 @ Z0)<=![X726:$i]:(((X725 @ (c_ordsucc @ X726))<=(X725 @ X726))))<=(X725 @ c_Empty)))))), inference(split_conjunct,[status(thm)],[c_0_4])).
1.31/0.81	thf(c_0_7, negated_conjecture, ![X239:$i]:(((c_In @ esk1_0 @ c_Empty)&((c_In @ esk2_0 @ esk1_0)&((c_In @ esk3_0 @ esk2_0)&((~(c_ordinal @ X239)|(epred1_2 @ (esk4_1 @ X239) @ X239))&((((((~(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|(c_ordinal @ X239))&(~(c_not @ $false)|(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|(c_ordinal @ X239)))&((~(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|~(c_not @ $true)|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|(c_ordinal @ X239))&(~(c_not @ $false)|~(c_not @ $true)|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|(c_ordinal @ X239))))&(~(c_atleast3 @ X239)|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|(c_ordinal @ X239)))&((((~(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|~(c_exactly2 @ X239))&(~(c_not @ $false)|(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|~(c_exactly2 @ X239)))&((~(c_atleast2 @ (c_Power @ (c_binrep @ (c_Power @ (c_Power @ c_Empty)) @ c_Empty)))|~(c_not @ $true)|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|~(c_exactly2 @ X239))&(~(c_not @ $false)|~(c_not @ $true)|((X239)=(esk4_1 @ X239))|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|~(c_exactly2 @ X239))))&(~(c_atleast3 @ X239)|(epred2_2 @ (esk4_1 @ X239) @ esk3_0)|~(c_atleast2 @ X239)|~(c_exactly2 @ X239))))&~(c_nat_p @ X239))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])).
1.31/0.81	thf(c_0_8, plain, ![X409:$i]:((![X727:$i > $o]:((((X727 @ X409)<=![X728:$i]:(((X727 @ (c_ordsucc @ X728))<=(X727 @ X728))))<=(X727 @ c_Empty)))<=>(c_nat_p @ X409))), inference(arg_cong,[status(thm)],[c_0_6])).
1.31/0.81	thf(c_0_9, negated_conjecture, ![X2:$i]:(~((c_nat_p @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
1.31/0.81	thf(c_0_10, plain, ![X2:$i]:(~((epred61_1 @ X2 @ X2))), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8]), c_0_9])).
1.31/0.81	thf(c_0_11, plain, ![X2:$i]:((epred61_1 @ X2 @ c_Empty)), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8]), c_0_9])).
1.31/0.81	thf(c_0_12, plain, ($false), inference(spm,[status(thm)],[c_0_10, c_0_11]), ['proof']).
1.31/0.81	# SZS output end CNFRefutation
1.31/0.81	# Parsed axioms                        : 213
1.31/0.81	# Removed by relevancy pruning/SinE    : 123
1.31/0.81	# Initial clauses                      : 256
1.31/0.81	# Removed in clause preprocessing      : 28
1.31/0.81	# Initial clauses in saturation        : 228
1.31/0.81	# Processed clauses                    : 2183
1.31/0.81	# ...of these trivial                  : 20
1.31/0.81	# ...subsumed                          : 603
1.31/0.81	# ...remaining for further processing  : 1560
1.31/0.81	# Other redundant clauses eliminated   : 19
1.31/0.81	# Clauses deleted for lack of memory   : 0
1.31/0.81	# Backward-subsumed                    : 374
1.31/0.81	# Backward-rewritten                   : 124
1.31/0.81	# Generated clauses                    : 7828
1.31/0.81	# ...of the previous two non-redundant : 6263
1.31/0.81	# ...aggressively subsumed             : 0
1.31/0.81	# Contextual simplify-reflections      : 38
1.31/0.81	# Paramodulations                      : 5483
1.31/0.81	# Factorizations                       : 0
1.31/0.81	# NegExts                              : 0
1.31/0.81	# Equation resolutions                 : 19
1.31/0.81	# Disequality decompositions           : 0
1.31/0.81	# Total rewrite steps                  : 1405
1.31/0.81	# ...of those cached                   : 1323
1.31/0.81	# Propositional unsat checks           : 0
1.31/0.81	#    Propositional check models        : 0
1.31/0.81	#    Propositional check unsatisfiable : 0
1.31/0.81	#    Propositional clauses             : 0
1.31/0.81	#    Propositional clauses after purity: 0
1.31/0.81	#    Propositional unsat core size     : 0
1.31/0.81	#    Propositional preprocessing time  : 0.000
1.31/0.81	#    Propositional encoding time       : 0.000
1.31/0.81	#    Propositional solver time         : 0.000
1.31/0.81	#    Success case prop preproc time    : 0.000
1.31/0.81	#    Success case prop encoding time   : 0.000
1.31/0.81	#    Success case prop solver time     : 0.000
1.31/0.81	# Current number of processed clauses  : 790
1.31/0.81	#    Positive orientable unit clauses  : 166
1.31/0.81	#    Positive unorientable unit clauses: 6
1.31/0.81	#    Negative unit clauses             : 22
1.31/0.81	#    Non-unit-clauses                  : 596
1.31/0.81	# Current number of unprocessed clauses: 4347
1.31/0.81	# ...number of literals in the above   : 21517
1.31/0.81	# Current number of archived formulas  : 0
1.31/0.81	# Current number of archived clauses   : 765
1.31/0.81	# Clause-clause subsumption calls (NU) : 169737
1.31/0.81	# Rec. Clause-clause subsumption calls : 81560
1.31/0.81	# Non-unit clause-clause subsumptions  : 481
1.31/0.81	# Unit Clause-clause subsumption calls : 4468
1.31/0.81	# Rewrite failures with RHS unbound    : 0
1.31/0.81	# BW rewrite match attempts            : 258
1.31/0.81	# BW rewrite match successes           : 15
1.31/0.81	# Condensation attempts                : 2204
1.31/0.81	# Condensation successes               : 9
1.31/0.81	# Termbank termtop insertions          : 217017
1.31/0.81	# Search garbage collected termcells   : 3598
1.31/0.81	
1.31/0.81	# -------------------------------------------------
1.31/0.81	# User time                : 0.278 s
1.31/0.81	# System time              : 0.021 s
1.31/0.81	# Total time               : 0.299 s
1.31/0.81	# Maximum resident set size: 2984 pages
1.31/0.81	
1.31/0.81	# -------------------------------------------------
1.31/0.81	# User time                : 0.286 s
1.31/0.81	# System time              : 0.022 s
1.31/0.81	# Total time               : 0.308 s
1.31/0.81	# Maximum resident set size: 2120 pages
1.31/0.81	% E---3.1 exiting
1.31/0.81	% E exiting
1.31/0.81	EOF